Bivariate Krawtchouk polynomials: Inversion and connection problems with the NAVIMA algorithm
نویسندگان
چکیده
منابع مشابه
Reconstruction problems for graphs, Krawtchouk polynomials and Diophantine equations
We give an overview about some reconstruction problems in graph theory, which are intimately related to integer roots of Krawtchouk polynomials. In this context, Tichy and the author recently showed that a binary Diophantine equation for Krawtchouk polynomials only has finitely many integral solution. Here, this result is extended. By using a method of Krasikov, we decide the general finiteness...
متن کاملMore zeros of krawtchouk polynomials
Three theorems are given for the integral zeros of Krawtchouk polynomials. First, five new infinite families of integral zeros for the binary (q = 2) Krawtchouk polynomials are found. Next, a lower bound is given for the next integral zero for the degree four polynomial. Finally, three new infinite families in q are found for the degree three polynomials. The techniques used are from elementary...
متن کاملOn Krawtchouk polynomials
Krawtchouk polynomials play an important role in coding theory and are also useful in graph theory and number theory. Although the basic properties of these polynomials are known to some extent, there is, to my knowledge, no detailed development available. My aim in writing this article is to fill in this gap. Notation In the following we will use capital letters for (algebraic) polynomials, fo...
متن کاملNew Bounds for Hahn and Krawtchouk Polynomials
For the Hahn and Krawtchouk polynomials orthogonal on the set {0, . . . , N} new identities for the sum of squares are derived which generalize the trigonometric identity for the Chebyshev polynomials of the first and second kind. These results are applied in order to obtain conditions (on the degree of the polynomials) such that the polynomials are bounded (on the interval [0, N ]) by their va...
متن کاملSingular polynomials for the symmetric group and Krawtchouk polynomials
A singular polynomial is one which is annihilated by all Dunkl operators for a certain parameter value. These polynomials were first studied by Dunkl, de Jeu and Opdam, (Trans. Amer. Math. Soc. 346 (1994), 237-256). This paper constructs a family of such polynomials associated to the irreducible representation (N − 2, 1, 1) of the symmetric group SN for odd N and parameter values − 1 2 ,− 3 2 ,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2015
ISSN: 0377-0427
DOI: 10.1016/j.cam.2014.11.022